New Facets of the QAP-Polytope
نویسندگان
چکیده
The Birkhoff polytope is defined to be the convex hull of permutation matrices, Pσ ∀σ ∈ Sn. We define a second-order permutation matrix P [2] σ in R ×n corresponding to a permutation σ as (P [2] σ )ij,kl = (Pσ)ij(Pσ)kl. We call the convex hull of the second-order permutation matrices, the second-order Birkhoff polytope and denote it by B. It can be seen that B is isomorphic to the QAP-polytope, the domain of optimization in quadratic assignment problem. In this work we revisit the polyhedral combinatorics of the QAP-polytope viewing it as B. Our main contribution is the identification of an exponentially large set of new facets of this polytope. Also we present a general inequality of which all the known facets of this polytope as well as the new ones, that we present in this paper, are special instances. We also establish the existence of more facets which are yet to be identified.
منابع مشابه
The QAP-polytope and the star transformation
The quadratic assignment problem (QAP) maybe was for a long time the one among the prominent NP-hard combinatorial optimization problems about which the fewest polyhedral results had been known. Recent work of Rijal (1995) and Padberg and Rijal (1996) has on the one hand yielded some basic facts about the associated quadratic assignment polytope, but has on the other hand shown that \naive" inv...
متن کاملAngewandte Mathematik Und Informatik Universit at Zu K Oln on the Sqap-polytope on the Sqap-polytope
The study of the QAP-Polytope was started by Rijal (1995), Padberg and Rijal (1996), and J unger and Kaibel (1996), investigating the structure of the feasible points of a (Mixed) Integer Linear Programming formulation of the QAP that provides good lower bounds by its continious relaxation. Rijal (1995) and Padberg and Rijal (1996) propose an alternative (Mixed) Integer Linear Programming formu...
متن کاملA Basic Study of the QAP - Polytope
We investigate a polytope (the QAP-Polytope) beyond a \natural" integer programming formulation of the Quadratic Assignment Problem (QAP) that has been used successfully in order to compute good lower bounds for the QAP in the very recent years. We present basic structural properties of the QAP-Polytope, partially independently also obtained by Rijal (1995). The main original contribution of th...
متن کاملNew facets for the planar subgraph polytope
This paper describes certain facet classes for the planar subgraph polytope. These facets are extensions of Kuratowski facets and are of the form 2x(U)+x(E(G)\U) ≤ 2|U |+|E(G)\U | −2 where the edge set U varies and can be empty. Two of the new types of facets complete the class of extended subdivision facets, explored by Jünger and Mutzel. In addition, the other types of facets consist of a new...
متن کاملAffine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
We consider two polytopes. The quadratic assignment polytope QAP(n) is the convex hull of the set of tensors x⊗x, x ∈ Pn, where Pn is the set of n×n permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph Kn we consider appropriate (n 2 ) × (n 2 ) permutation matrix of the edges of Kn. The Young polytope P ((n − 2, 2)) is the conv...
متن کامل